Spherical convex hull of random points on a wedge
نویسندگان
چکیده
Abstract Consider two half-spaces $$H_1^+$$ H 1 + and $$H_2^+$$ 2 in $${\mathbb {R}}^{d+1}$$ R d whose bounding hyperplanes $$H_1$$ $$H_2$$ are orthogonal pass through the origin. The intersection {S}}_{2,+}^d:={\mathbb {S}}^d\cap H_1^+\cap H_2^+$$ S , : = ∩ is a spherical convex subset of d -dimensional unit sphere {S}}^d$$ , which contains great subsphere dimension $$d-2$$ - called wedge. Choose n independent random points uniformly at on {S}}_{2,+}^d$$ consider expected facet number hull these points. It shown that, up to terms lower order, this expectation grows like constant multiple $$\log n$$ log n . A similar behaviour obtained for homogeneous Poisson point process result compared corresponding classical Euclidean polytopes half-sphere.
منابع مشابه
On the convex hull of random points in a polytope
'This research was sponsored by the National Science Foundation under Grant No. ECS-8418392. The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of the National Science Foundation or the US Government. On the Convex Hull of Random Points in a Polytope R e x A . D w y e r * ...
متن کاملOn Computing the Convex Hull of (Piecewise) Spherical Objects
We utilize support functions to transform the problem of constructing the convex hull of a finite set of spherical objects into the problem of computing the upper envelope of piecewise linear functions. This approach is particularly suited if the objects are (possibly intersecting) circular arcs in the plane or spheres in three-space.
متن کاملOn the Most Likely Convex Hull of Uncertain Points
Consider a set of d-dimensional points where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many choices. We are interested in finding the most likely convex hull, namely, the one with the maximum probability of occurrence. We investigate this problem under two natural model...
متن کاملConvex hull for intersections of random lines
Numerous problems can be reduced to finding the convex hull of a set of points – halfspace intersection, Delaunay triangulation, etc. An algorithm for finding the convex hull in the plane, known as Graham scan [5], achieves an O(n log n) running time. This algorithm is optimal in the worst case. Another algorithm [6] for the same problem runs in O(nh) time, where h is the number of hull points,...
متن کاملArea and Perimeter of the Convex Hull of Stochastic Points
Given a set P of n points in the plane, we study the computation of the probability distribution function of both the area and perimeter of the convex hull of a random subset S of P . The random subset S is formed by drawing each point p of P independently with a given rational probability πp. For both measures of the convex hull, we show that it is #P-hard to compute the probability that the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Annalen
سال: 2023
ISSN: ['1432-1807', '0025-5831']
DOI: https://doi.org/10.1007/s00208-023-02704-9